Redundancy allocation in finite-length nested codes for nonvolatile memories

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Redundancy allocation in finite-length nested codes for nonvolatile memories

In this paper, we investigate the optimum way to allocate redundancy of finite-length nested codes for modern nonvolatile memories suffering from both permanent defects and transient errors (erasures or random errors). A nested coding approach such as partitioned codes can handle both permanent defects and transient errors by using two parts of redundancy: 1) redundancy to deal with permanent d...

متن کامل

Balanced Modulation for Nonvolatile Memories

This paper presents a practical writing/reading scheme in nonvolatile memories, called balanced modulation, for minimizing the asymmetric component of errors. The main idea is to encode data using a balanced error-correcting code. When reading information from a block, it adjusts the reading threshold such that the resulting word is also balanced or approximately balanced. Balanced modulation h...

متن کامل

The Future of Nonvolatile Memories

Driven by an increasing demand for mobile devices, the market for nonvolatile memories is rapidly growing [1]. Today all nonvolatile memories are based on charge storage and are fabricated by materials available in CMOS processes. These devices have some general shortcomings like slow programming (from microseconds up to milliseconds), limited endurance (typically 10 – 10 write/erase cycles) as...

متن کامل

On Infinitary Finite Length Codes

For a code CcX* the following four conditions are considered: (i) for ail words u, v, in X* and for every word w in C*, wu, uv, vu in C* imply u, v in C*. (ii) every onesided infinité product of words of C is unambiguous. (Ui) C has flnite decoding delay. (iv) C has bounded decoding delay. lt is shown that in gênerai (iv) —> (Ui) —• (ii) -* (ï), and the reverse implications are not true; wherea...

متن کامل

A Memtic genetic algorithm for a redundancy allocation problem

Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Communications and Networks

سال: 2018

ISSN: 1229-2370,1976-5541

DOI: 10.1109/jcn.2018.000051